Fixed set search applied to the multi-objective minimum weighted vertex cover problem

Abstract The Fixed Set Search (FSS) is a novel metaheuristic that adds learning mechanism to the Greedy Randomized Adaptive Procedure (GRASP). In recent publications, its efficiency has been shown on different types of combinatorial optimization problems like routing, machine scheduling and covering. this paper FSS adapted multi-objective for finding Pareto Front approximations. This adaptation illustrated bi-objective Minimum Weighted Vertex Cover Problem (MWVCP). work, simple effective GRASP algorithm MWVCP developed in first stage. One important characteristic proposed it avoids use weighted sums objective functions local search greedy algorithm. second stage, extended by adding problems. conducted computational experiments show significantly outperforms existing methods MWVCP. To fully evaluate FSS, compared underlying wide range performance indicators related convergence, distribution, spread cardinality.